Searching

Searching

This section deals with searching. Searching is a way to solve a lot of many problems. Here are three ways of searching explained. I will use a language as neutral as possible, it's much alike the Pascal language, but programmers programming in other language should be able to understand that language.

Linear Search

Linear Search is the most common search algorithm. There is 1 condition if you want to apply this algorithm. You must be sure the thing you are searching must be searchable or else this algorithm doesn't work.

Bounded Linear Search

Not yet available!!

This algorithm is almost the same as Linear Search. But this Bounded Linear Search doesn't have any condition. You can consider this one as an improved version of Linear Search.

Binary Search

Not yet available!!

Binary Search is a very fast way of searching. But if you want to use this algorithm then you must be sure that the thing you are searching must be searchable AND the medium you are searching in must be ascending or descending. This algorithm is very usefull if you understand it.

Slope Search

Not yet available

The three searching algorithms above is usefull if you just have 1 variable (a long array), but for 2 variables (a matrix) Slope Search is very efficient. An example is drawing circles or lines.

[Education][Stories][Links][About this homepage]
[Comments]

Linear Search	Linear Search is the most common search algorithm. There is 1 condition if you want to apply this algorithm. You must be sure the thing you are searching must be searchable or else this algorithm doesn't work.
Bounded Linear Search	Not yet available!! This algorithm is almost the same as Linear Search. But this Bounded Linear Search doesn't have any condition. You can consider this one as an improved version of Linear Search.
Binary Search	Not yet available!! Binary Search is a very fast way of searching. But if you want to use this algorithm then you must be sure that the thing you are searching must be searchable AND the medium you are searching in must be ascending or descending. This algorithm is very usefull if you understand it.
Slope Search	Not yet available The three searching algorithms above is usefull if you just have 1 variable (a long array), but for 2 variables (a matrix) Slope Search is very efficient. An example is drawing circles or lines.